package sort

func QuickSort(a []int) {
	quickSort(a, 0, len(a)-1)
}

func quickSort(a []int, start, end int) {
	if start >= end {
		return
	}
	mid := partition(a, start, end)
	quickSort(a, start, mid-1)
	quickSort(a, mid+1, end)
}

func partition(a []int, start, end int) int {
	return start
}
